Algorithms for fast multidimensional signal extraction
نویسندگان
چکیده
منابع مشابه
Fast Algorithms for Multidimensional Harmonic Retrieval
Classic multidimensional harmonic retrieval is the estimation problem in a variety of practical applications, including sensor array processing, radar, mobile communications, multiple-input multiple-output (MIMO) channel estimation and nuclear magnetic resonance spectroscopy. Numerous parametric subspace approaches have been proposed recently to solve this problem, among which the so-called ESP...
متن کاملFast multidimensional Bernstein-Lagrange algorithms
In this paper we present two fast algorithms for the Bézier curves and surfaces of an arbitrary dimension. The first algorithm evaluates the Bernstein-Bézier curves and surfaces at a set of specific points by using the fast Bernstein-Lagrange transformation. The second algorithm is an inversion of the first one. Both algorithms reduce the initial problem to computation of some discrete Fourier ...
متن کاملFast and Sample Near-Optimal Algorithms for Learning Multidimensional Histograms
We study the problem of robustly learning multi-dimensional histograms. A d-dimensional function h : D → R is called a k-histogram if there exists a partition of the domain D ⊆ R into k axis-aligned rectangles such that h is constant within each such rectangle. Let f : D → R be a d-dimensional probability density function and suppose that f is OPT-close, in L1-distance, to an unknown k-histogra...
متن کاملA Method for Validating Multidimensional Fast Fourier Transform (FFT) Algorithms,
A method is described for validating fast Fourier transforms (FFTs) based on the use of simple input fiinctions whose discrete Fourier transforms can be evaluated in closed form. Explicit analytical results are developed for one-dimensional and two-dimensional discrete Fourier transforms. The analytical results are easily generalized to higher dimensions. The results offer a means for validatin...
متن کاملComparison of envelope extraction algorithms for cardiac sound signal segmentation
This paper describes a comparative study of the envelope extraction algorithms for the cardiac sound signal segmentation. In order to extract the envelope curves based on the time elapses of the first and the second heart sounds of cardiac sound signals, three representative algorithms such as the normalized average Shannon energy, the envelope information of Hilbert transform, and the cardiac ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1985
ISSN: 0022-247X
DOI: 10.1016/0022-247x(85)90371-3